Naive Bayes and Decision Trees for Function Tagging
نویسندگان
چکیده
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree. Function tags are extra functional information, such as logical subject or predicate, that can be added to certain nodes in syntactic parse trees. We model the function tags assignment problem as a classification problem. Each function tag is regarded as a class and the task is to find what class/tag a given node in a parse tree belongs to from a set of predefined classes/tags. The paper offers the first systematic comparison of the two techniques, naive Bayes and decision trees, for the task of function tags assignment. The comparison is based on a standardized data set.
منابع مشابه
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffding Trees—Hoeffding Trees with naive Bayes models at the leaf nodes—albeit with increased runtime compared to standard Hoeffding Trees. In this paper, we show that runtime can be reduced by replacing naive Bayes with perceptron c...
متن کاملScaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid
Naive-Bayes induction algorithms were previously shown to be surprisingly accurate on many classii-cation tasks even when the conditional independence assumption on which they are based is violated. However , most studies were done on small databases. We show that in some larger databases, the accuracy of Naive-Bayes does not scale up as well as decision trees. We then propose a new algorithm, ...
متن کاملInt Reduction
Naive-Bayes induction algorithms were previously shown to be surprisingly accurate on many classification tasks even when the conditional independence assumption on which they are based is violated. However, most studies were done on small databases. We show that in some larger databases, the accuracy of Naive-Bayes does not scale up as well as decision trees. We then propose a new algorithm, N...
متن کاملScaling Up the Accuracy of Naive Bayes Classi ers a Decision Tree Hybrid
Naive Bayes induction algorithms were previously shown to be surprisingly accurate on many classi cation tasks even when the conditional independence assumption on which they are based is violated How ever most studies were done on small databases We show that in some larger databases the accuracy of Naive Bayes does not scale up as well as decision trees We then propose a new algorithm NBTree ...
متن کاملAn Evaluation Study of Machine Learning Techniques for Identifying Spam
In this work, we investigate the use of two kinds of machine learning techniques Decision Trees and Naive Bayes applied to the problem of spam classification. We first consider building a decision tree for this purpose and then, investigate building an ensemble of decision trees using boosting. Decision trees are seen to give fairly good classification accuracy of around 92% and with the use of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- International Journal on Artificial Intelligence Tools
دوره 17 شماره
صفحات -
تاریخ انتشار 2007